A VOMR-TREE BASED PARALLEL RANGE QUERY METHOD ON DISTRIBUTED SPATIAL DATABASE

A Vomr-tree Based Parallel Range Query Method on Distributed Spatial Database

Spatial index impacts upon the efficiency of spatial query seriously in distributed spatial database. In this paper, we introduce a parallel spatial range query algorithm, based on VoMR-tree index, which incorporates Voronoi diagrams into MR-tree, benefiting from the nearest neighbors. We first augments MR-tree to store the nearest neighbors and constructs the VoMR-tree index by Voronoi diagram...

Spatial Data Dynamic Balancing Distribution Method Based on the Minimum Spatial Proximity for Parallel Spatial Database

Spatial data balancing distribution can evidently improve the performance of parallel spatial database in shared nothing parallel architecture. Considering spatial locality and unstructured variable length characteristics of spatial data, this paper proposes a dynamic spatial data balancing distribution method under shared nothing parallel database environment. By using Hilbert ordering code to...

Scalable Range Query Processing for Large-Scale Distributed Database Applications

Peer-to-peer (P2P) systems provide a robust, scalable and decentralized way to share and publish data. Although highly efficient, current P2P index structures based on Distributed Hash Tables (DHTs) provide only exact match data lookups. This compromises their use in database applications where more advanced query facilities, such as range queries, are a key requirement. In this paper, we give ...

Scalable Distributed Query Processing in Parallel Main-Memory Database Systems

The continuous increase in compute speed and main-memory capacity of modern servers triggered the development of a new generation of in-memory database systems. These systems completely rewrote the traditional database architecture to use main memory as primary storage. Discarding several now obsolete abstractions of disk-based database systems enabled unprecedented query performance on a singl...

Distributed Segment Tree: A Unified Architecture to Support Range Query and Cover Query